Comments on Integer Sorting on Sum-CRCW
نویسنده
چکیده
Given an array X of n elements from a restricted domain of integers [1, n]. The integer sorting problem is the rearrangement of n integers in ascending order. We study the first optimal deterministic sublogarithmic algorithm for integer sorting on CRCW PRAM. We give two comments on the algorithm. The first comment is the algorithm not runs in sublogarithmic time for any distribution of input data. The second comment is the cost of the algorithm is not linear. Then, we modify the algorithm to be optimal in sense of cost with a restriction on the input data. Our modification algorithm has time complexity O( log n log log n ) using n log log n log n Sum-CRCW processors. Also, the algorithm has linear space.
منابع مشابه
An improved reliability bound of a probabilistic parallel integer sorting algorithm
It is shown how one can improve the reliability bound of the parallel sorting algorithm of Rajasekaran and Sen [7] that sorts uniformly distributed integer keys on a CRCW Parallel Random Access Machine (PRAM). The probability of success improves to 1 − 2−Ω(n log logn/ logn) from the previous bound of 1 − 2−Ω(n/(logn log logn)) while retaining the Õ(log n) time bound for sorting n uniformly dist...
متن کاملE cient Low Contention Parallel Algorithms
The queue read queue write qrqw parallel random access machine pram model permits concurrent reading and writing to shared memory locations but at a cost propor tional to the number of readers writers to any one memory location in a given step The qrqw pram model re#ects the contention properties of most commercially available par allel machines more accurately than either the well studied crcw...
متن کاملFinding Triconnected Components by Local Replacements
We present a parallel algorithm for nding triconnected components on a CRCW PRAM. The time complexity of our algorithm is O(logn) and the processor-time product is O((m + n) log logn) where n is the number of vertices, and m is the number of edges of the input graph. Our algorithm, like other parallel algorithms for this problem, is based on open ear decomposition but it employs a new technique...
متن کاملFinding Triconnected Components by Local Replacement 1
We present a parallel algorithm for nding triconnected components on a CRCW PRAM. The time complexity of our algorithm is O(log n) and the processor-time product is O((m + n) log log n) where n is the number of vertices, and m is the number of edges of the input graph. Our algorithm, like other parallel algorithms for this problem, is based on open ear decomposition but it employs a new techniq...
متن کاملPareto-based Multi-criteria Evolutionary Algorithm for Parallel Machines Scheduling Problem with Sequence-dependent Setup Times
This paper addresses an unrelated multi-machine scheduling problem with sequence-dependent setup time, release date and processing set restriction to minimize the sum of weighted earliness/tardiness penalties and the sum of completion times, which is known to be NP-hard. A Mixed Integer Programming (MIP) model is proposed to formulate the considered multi-criteria problem. Also, to solve the mo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006